Eecient Robdd Based Computation of Common Decomposition Functions of Multi-output Boolean Functions
نویسندگان
چکیده
One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f =
منابع مشابه
Based FPGA Synthesis for Multi - Output Boolean Functions
| One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f = (f 1 ; : : : ; f m ) : f0; 1g n ! f0; 1g m have to deal with is nding sublogic which can be shared by di erent outputs, i.e., nding boolean functions = ( 1 ; : : : ; h ) : f0; 1g p ! f0; 1g h which can be used as common sublogic of good realizations of f 1 ; : : : ; f m . In this paper we...
متن کاملBased FPGA Synthesis for Multi - Output
1 Communication Based FPGA Synthesis for Multi-Output Boolean Functions Christoph Scholl Paul Molitor Department of Computer Science Department of Computer Science Universit at des Saarlandes Martin-Luther Universit at Halle D 66041 Saarbr ucken, FRG D-06099 Halle (Saale), FRG Tel: ++49 681 302-2274 Tel: ++49 345 622 529 Fax: ++49 681 302-4421 Fax: ++49 345 622 514 e-mail: [email protected]...
متن کاملEecient Robdd Operations for Program Analysis
Reduced Ordered Binary Decision Diagrams (ROB-DDs), also known as Bryant graphs, are a representation for Boolean functions supporting many eecient operations. Because of this, they have often been used to implement the positive Boolean functions for program analysis. Some ROBDD operations heavily used in program analysis, however, are still rather expensive. The undertaking of the present pape...
متن کاملApproximative Representation of Boolean Functions by Size Controllable Robdd's
ROBDD's((2]) are a very popular datastructure for the representation and manipulation of boolean functions. They have tractable sizes for many boolean functions and come up with eecient algorithms for boolean operations. In the worst case however, size and time complexity grows exponentially when performing a polynomial number of operations. However, there are applications where an approximate ...
متن کاملDecomposition of Multi-Output Boolean Functions∗
In this paper the problem of decomposition, mapping and minimization of multi-output boolean functions is discussed. First the mathematical formulation for single-output boolean functions is presented and then it is extended to multi-output functions. The proposed formulations use function decompositions, ETDDs (EXOR ternary decision diagrams) and multi-valued logic.
متن کامل